A Modified Merging Approach for Datapath Configuration Time Reduction
نویسندگان
چکیده
This paper represents a modified datapath merging technique to amortize the configuration latency of mapping datapaths on reconfigurable fabric in Run-Time Reconfigurable Systems (RTR). This method embeds together the different Data Flow Graphs (DFGs), corresponding to the loop kernels to create a single datapath (merged datapath) instead of multiple datapaths. The DFGs are merged in steps where each step corresponds to combining a DFG onto the merged datapath. Afterwards, the method combines the resources inside the merged datapath to minimize the configuration time by employing the maximum weighted clique technique. The proposed merging technique is evaluated using the Media-bench suit workloads. The results indicate that our technique outperforms previous HLS approaches aimed at RTR systems and reduces the datapath configuration time up to 10%.
منابع مشابه
Algoritmos para alocação de recursos em arquiteturas reconfiguraveis
Recent work in reconfigurable architectures shows that they offer a better performance than general purpose processors (GPPs), while offering more flexibility than ASICs (Application Specific Integrated Circuits). A reconfigurable architecture can be adapted to implement different applications, thus allowing the specialization of the hardware according to the computational demands. In this work...
متن کاملAn Approach to Verification of Datapath Circuits
In order to easily verify timed asynchronous circuits including datapaths, this paper proposes an approach to verifying datapath circuits partially with a prescribed set of data values as well as some random values and verifying control circuits formally as usual. From the regularity of datapath circuits, this approach is expected to provide a good balance between the cost and quality of verifi...
متن کاملA performance-efficient and datapath-regular implementation of modified split-radix fast Fourier transform
Discrete Fourier transform (DFT) finds various applications in signal processing, image processing, artificial intelligent, and fuzzy logic etc. DFT is often computed efficiently with Fast Fourier transform (FFT). The modified split radix FFT (MSRFFT) algorithm implements a length-N=2 DFT achieving a reduction of arithmetic complexity compared to split-radix FFT (SRFFT). In this paper, a simpli...
متن کاملAutomated exploration of datapath and unrolling factor during power-performance tradeoff in architectural synthesis using multi-dimensional PSO algorithm
A novel algorithm for automated simultaneous exploration of datapath and Unrolling Factor (UF) during power–performance tradeoff in High Level Synthesis (HLS) using multi-dimensional particle swarm optimization (PSO) (termed as ‘M-PSO’) for control and data flow graphs (CDFGs) is presented. The major contributions of the proposed algorithm are as follows: (a) simultaneous exploration of datapat...
متن کاملOptimizing scrubbing by netlist analysis for FPGA configuration bit classification and floorplanning
Existing scrubbing techniques for SEU mitigation on FPGAs do not guarantee an error-free operation after SEU recovering if the affected configuration bits do belong to feedback loops of the implemented circuits. In this paper, we a) provide a netlist-based circuit analysis technique to distinguish so-called critical configuration bits from essential bits in order to identify configuration bits ...
متن کامل